How many positions can we perceptually encode, one or many?
نویسندگان
چکیده
منابع مشابه
How many positions can we perceptually encode, one or many?
Here we show that our sensitivity for discriminating relative position across the visual field is limited. In experiment 1 we show that we are much worse at detecting a texture defined by the relative position of elements within an array than would be expected if we had access to multiple estimates of relative position across the visual field. In experiment 2 we show that human performance is i...
متن کاملHow Many Lions Can One Man Avoid?
A pride of lions are prowling among the vertices and edges of an n × n grid. If their paths are known in advance, is it possible to design a safe path for a man that avoids all lions, assuming that man and lion move at the same speed? In their recent paper [2], Dumitrescu et al. employed probabilistic arguments to show that the number of lions which can always be avoided, k(n), lies in Ω( √ n)....
متن کاملHow many times can we defibrillate a patient ?
Ventricular fibrillation (VF) is the cardiac rhythm disturbance which is the number one cause of cardiac arrest. Most common etiologic factor is the coronary heart disease [1]. VF may occur due to acute myocardial ischemia, infarction or a scar tissue formed previously because of a prior myocardial infarction (MI). Defibrillation is the first line therapy. Antiarrhythmic drugs should also be ad...
متن کاملKlein How Many Lions Can One Man Avoid ?
A pride of lions are prowling among the vertices and edges of an n×n grid. If their paths are known in advance, is it possible to design a safe path for a man that avoids all lions, assuming that man and lion move at the same speed? In their recent paper [4], Dumitrescu et al. employed probabilistic arguments to show that O( √ n) lions can always be avoided. They raised the question if it is al...
متن کاملHow Many Ways Can One Draw a Graph?
Using results from extremal graph theory, we determine the asymptotic number of string graphs with n vertices, i.e., graphs that can be obtained as the intersection graph of a system of continuous arcs in the plane. The number becomes much smaller, for any fixed d, if we restrict our attention to systems of arcs, any two of which cross at most d times. As an application, we estimate the number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vision Research
سال: 2003
ISSN: 0042-6989
DOI: 10.1016/s0042-6989(03)00122-6